Plackett-Luce Networks for Dyad Ranking

نویسندگان

  • Dirk Schäfer
  • Eyke Hüllermeier
چکیده

We propose a new method for dyad ranking, a problem that was recently introduced in the realm of preference learning. Our method, called PLNet, combines a statistical model for rank data, namely the Plackett-Luce model, with neural networks (feed-forward multi-layer perceptrons) in order to learn joint-feature representations for dyads, which are pairs of objects from two domains. The efficacy of PLNet is shown by comparing it experimentally with state-of-the-art methods for dyad and label ranking.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Latent-Feature Plackett-Luce Model for Dyad Ranking Completion

Dyad ranking is a specific type of preference learning problem, namely the problem of learning a model that is capable of ranking a set of feature vector pairs, called dyads. In this paper a situation is considered where feature vectors consists of identifiers only. A new method based on learning latent-features is introduced for this purpose. The method is evaluated on synthetic data and is ap...

متن کامل

Dyad Ranking Using a Bilinear Plackett-Luce Model

Preference learning is an emerging subfield of machine learning, which deals with the induction of preference models from observed or revealed preference information [2]. Such models are typically used for prediction purposes, for example, to predict context-dependent preferences of individuals on various choice alternatives. Depending on the representation of preferences, individuals, alternat...

متن کامل

Label Ranking Methods based on the Plackett-Luce Model

This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the PL model to fit locally constant probability models in the context of instance-based learning. As opposed to this, the second method estimates a global model in which the PL parameters are represented as functions of t...

متن کامل

Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach

We study the problem of online rank elicitation, assuming that rankings of a set of alternatives obey the Plackett-Luce distribution. Following the setting of the dueling bandits problem, the learner is allowed to query pairwise comparisons between alternatives, i.e., to sample pairwise marginals of the distribution in an online fashion. Using this information, the learner seeks to reliably pre...

متن کامل

Random Utility Theory for Social Choice

Random utility theory models an agent’s preferences on alternatives by drawing a real-valued score on each alternative (typically independently) from a parameterized distribution, and then ranking the alternatives according to scores. A special case that has received significant attention is the Plackett-Luce model, for which fast inference methods for maximum likelihood estimators are availabl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016